A note on scheduling to meet two min-sum objectives
نویسندگان
چکیده
We consider the problem of scheduling a set of independent jobs on a single machine where a solution is evaluated with respect to two min-sum objective functions: the sum of completion times and the sum of weighted completion times. In particular, we are interested in (α,β)-approximate schedules, i.e., schedules which are simultaneously at most α times from the optimum for the first objective, and β times from the optimum for the second objective. We propose a simple polynomial time (1+ γ ,1+γ)-approximation algorithm which for any γ > 0 always outputs (1+ γ ,1+ γ)-approximate schedules. In addition, we show that for γ > 1, it is not possible to get an (x,y)-approximation algorithm with 1 < x < 1+ γ and 1 < y < 1+ γ−1 2+γ .
منابع مشابه
Multi-objective Solution Approaches for Employee Shift Scheduling Problems in Service Sectors (RESEARCH NOTE)
Today, workforce scheduling programs are being implemented in many production and service centers. These sectors can provide better quality products and/or services to their customers, taking into account employees’ desires and preferences in order to increase sector productivity. In this study, an employee shift scheduling problem in the service sector is discussed. In the problem, the aim is ...
متن کاملOptimization of Time, Cost, and Quality in Critical Chain Method Using Simulated Annealing (RESEARCH NOTE)
In the last decade, theory of constraint application in project management lead to make a new approach for project scheduling and control as a critical chain. In this paper, a multi-objective optimization model for multi-project scheduling on critical chain is investigated. The objectives include time, cost and quality. In order to solve the problem, a Simulated Annealing algorithm is developed...
متن کاملAppling Metaheuristic Algorithms on a Two Stage Hybrid Flowshop Scheduling Problem with Serial Batching (RESEARCH NOTE)
In this paper the problem of serial batch scheduling in a two-stage hybrid flow shop environment with minimizing Makesapn is investigated. In serial batching it is assumed that jobs in a batch are processed serially, and their completion time is defined to be equal to the finishing time of the last job in the batch. The analysis and implementation of the prohibited transference of jobs among th...
متن کاملA Nurse Scheduling Model under Real Life Constraints
Background and Objectives: In this paper, a real life nurse scheduling model is described based on the conditions in Iranian hospitals such as monthly shift rotation, consecutive morning and evening shifts and consecutive evening and night shift. Methods: The developed model considers both hospital constraints and nurses’ preferences. Hospital constraints include assigning adequate qualifie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Oper. Res. Lett.
دوره 35 شماره
صفحات -
تاریخ انتشار 2007